منابع مشابه
Why Machines Cannot be
Mental processes are abstracted from a subset of the physical universe ; these, in turn, lead to the world of ideas. Although these ideas include quantum logic, no credible way has yet been found that constructs machines which use superimposed possibilities in the style of quantum logic, more general in computing power to machines based on classical logic. Machine theories are based exclusively...
متن کاملInvisible Stimuli, Implicit Thresholds: Why Invisibility Judgments Cannot be Interpreted in Isolation
Some studies of unconscious cognition rely on judgments of participants stating that they have "not seen" the critical stimulus (e.g., in a masked-priming experiment). Trials in which participants gave invisibility judgments are then treated as those where the critical stimulus was "subliminal" or "unconscious," as opposed to trials with higher visibility ratings. Sometimes, only these trials a...
متن کاملAggregating preferences cannot be fair
SOMMARIO/ABSTRACT Preferences typically define a partial ordering over outcomes. A number of formalisms like soft constraints and CP-nets exists to specify such partial or-derings. In situations involving multiple agents, we need to combine the preferences of several individuals. In this paper, we consider each agent as voting on whether they prefer one outcome to another. We prove that, under ...
متن کاملQuantum History Cannot Be Copied
We show that unitarity does not allow cloning of any two points in a ray. This has implication for cloning of the geometric phase information in a quantum state. In particular, the quantum history which is encoded in the geometric phase during cyclic evolution of a quantum system cannot be copied. We also prove that the generalized geometric phase information cannot be copied by a unitary opera...
متن کاملSolovay's theorem cannot be simplified
In this paper we consider three potential simplifications to a result of Solovay’s concerning the Turing degrees of nonstandard models of arbitrary completions of first-order Peano Arithmetic (PA). Solovay characterized the degrees of nonstandard models of completions T of PA, showing that they are the degrees of sets X such that there is an enumeration R ≤T X of an “appropriate” Scott set and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMJ
سال: 2006
ISSN: 0959-8138,1468-5833
DOI: 10.1136/bmj.333.7567.552